Cliques, minors and apex graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cliques, minors and apex graphs

In this paper, we proved the following result: Let G be a (k + 2)-connected, non-(k − 3)apex graph where k ≥ 2. If G contains three k-cliques, say L1, L2, L3, such that |Li ∩ Lj| ≤ k − 2(1 ≤ i < j ≤ 3), then G contains a Kk+2 as a minor. Note that a graph G is t-apex if G− X is planar for some subset X ⊆ V (G) of order at most t . This theorem generalizes some earlier results by Robertson, Seym...

متن کامل

Cliques in random graphs

1. Introduction. Let 0 < p < 1 be fixed and denote by G a random graph with point set N, the set of natural numbers, such that each edge occurs with probability p, independently of all other edges. In other words the random variables ei5 , 1 < i < j, defined by _ 1 if (i, j) is an edge of G, et '-0 if (i, j) is not an edge of G, are independent r .v.'s with P(e i, = 1) = p, P(eij = 0) = 1-p. De...

متن کامل

Dominating cliques in graphs

A set of vertices is a dominating set in a graph if every vertex not in the dominating set is adjacent to one or more vertices in the dominating set. A dominating clique is a dominating set that induces a complete subgraph. Forbidden subgraph conditions sufficient to imply the existence of a dominating clique are given. For certain classes of graphs, a polynomial algorithm is given for finding ...

متن کامل

Minors in expanding graphs

In this paper we address several extremal problems related to graph minors. In all of our results we assume essentially that a given graph G is expanding, where expansion is either postulated directly, or G can be shown to contain a large expanding subgraph, or G is locally expanding due to the fact that G does not contain a copy of a fixed bipartite graph H. We need the following definitions t...

متن کامل

Universal Graphs without Large Cliques

The theory of universal graphs originated from the observation of R. Rado [4,5] that a universal countable graph X exists, i.e., X is countable and isomorphically embeds every countable graph. He also showed that under GCH, there is a universal graph in every infinite cardinal. Since then, several results have been proved about the existence of universal elements in different classes of graphs....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2009

ISSN: 0012-365X

DOI: 10.1016/j.disc.2008.12.009